Decimation-invariant sequences and their automaticity
نویسندگان
چکیده
منابع مشابه
Decimation-invariant sequences and their automaticity
This paper deals with one-dimensional bidirectional sequences a : Z → V , V a 4nite set, such that any p-decimation (|p|¿2) of the sequence reproduces the sequence (modulo a certain shift). We develop a procedure for solving the underlying decimation-invariance (DI) equations and 4nd that the number of solutions is always 4nite. Conditions for equivalency among solutions of di8erently parametri...
متن کاملFibonacci Numbers and Decimation of Binary Sequences
The problem of computing the number of sequences of various lengths that can be obtained by decimating a given binary sequence X of length n is considered. It is proven that this number is maximized iff X is an alternating sequence and that the maximum can be expressed in terms of the Fibonacci numbers. Some other upper bounds on this number are also determined, including another bound in terms...
متن کاملAutomaticity IV : sequences, sets, and diversity
This paper studies the descriptional complexity of (i) sequences over a finite alphabet; and (ii) subsets of N (the natural numbers). If (s (i )) i ~0 is a sequence over a finite alphab et 0394, then we define the k-automaticity of s, Aks(n), to be the smallest possible number of states in any deterministic finite automaton that, for all i with 0 ~ i ~ n, takes i expressed in base k as input an...
متن کاملDecimation Generator of Zadoff-Chu Sequences
A compact expression for Zadoff-Chu sequences is introduced and used to show that all sequences of a given odd prime length are permutations of two seed sequences. In addition, it helps us derive a decimation formula and demonstrate that when two pre-calculated seed sequences and stored in the memory, any desired Zadoff-Chu sequence of odd prime length can be generated, sample-by-sample, simply...
متن کاملA Criterion for Non-automaticity of Sequences
We give a criterion for a sequence (an)n≥1 to be non-automatic, i.e., for when there does not exist a finite automaton generating this sequence. As application we generalize a result of Yazdani on the non-automaticity of multiplicative sequences.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2001
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00021-9